Elucidating the Short Term Loss Behavior of Markovian-Modulated Batch-Service Queueing Model with Discrete-Time Batch Markovian Arrival Process
نویسندگان
چکیده
منابع مشابه
A Batch-Service Queueing Model with a Discrete Batch Markovian Arrival Process
Abstract. Queueing systems with batch service have been investigated extensively during the past decades. However, nearly all the studied models share the common feature that an uncorrelated arrival process is considered, which is unrealistic in several real-life situations. In this paper, we study a discrete-time queueing model, with a server that only initiates service when the amount of cust...
متن کاملLoss behavior in space priority queue with batch Markovian arrival process - continuous-time case
This paper applies a matrix-analytic approach to analyze both the long-term and the short-term loss behaviors of a queue with space priority scheme. Five related performance measures are derived from conditional statistics, including the long-term highpriority and low-priority packet loss probabilities, and the three short-term measures — the average length of a critical period, the average len...
متن کاملBatch Markovian Arrival Processes (BMAP)
This article describes the batch Markovian arrival process (BMAP), a point process that is characterized by Markov-modulated batch arrivals of random size. The BMAP is a generalization of many well-known processes including the Markovian arrival process (MAP), the Poisson process, and the Markov-modulated Poisson process. It provides a common framework for modeling arrival processes in a variet...
متن کاملModeling IP traffic using the batch Markovian arrival process
In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP). In fact, effective computational formulas for the E-step of the EM algorithm are presented, which utilize the well-known randomization technique and a stable calculation of Poisson jump probabilities. Moreover, w...
متن کاملFinite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process
Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/814810